<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="zh">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.11.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>cppMISC: include/container/bplus.hpp 源文件</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript" src="../../darkmode_toggle.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">cppMISC<span id="projectnumber">&#160;v1.1</span>
   </div>
   <div id="projectbrief">cppMisc 文档系统</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.11.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
  initMenu('../../',true,false,'search.php','搜索',false);
  $(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){ initResizable(false); });
/* @license-end */
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">载入中...</div>
<div class="SRStatus" id="Searching">搜索中...</div>
<div class="SRStatus" id="NoMatches">未找到</div>
</div>
</div>
</div>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="../../dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="../../dir_e0f5f6345e438c73b9ae78ec2940718c.html">container</a></li>  </ul>
</div>
</div><!-- top -->
<div id="doc-content">
<div class="header">
  <div class="headertitle"><div class="title">bplus.hpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../de/d8d/bplus_8hpp.html">浏览该文件的文档.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;type_traits&gt;</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Key, <span class="keyword">typename</span> Value, <span class="keywordtype">int</span> Order = 3&gt;</div>
<div class="foldopen" id="foldopen00008" data-start="{" data-end="};">
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"><a class="line" href="../../dc/d91/class_b_plus_tree.html">    8</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dc/d91/class_b_plus_tree.html">BPlusTree</a> {</div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"><a class="line" href="../../dc/d91/class_b_plus_tree.html#a950402099e27c7d4496286691f154f68">   10</a></span>    <span class="keyword">using </span><a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#a950402099e27c7d4496286691f154f68">key_type</a> = std::decay_t&lt;Key&gt;;</div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../dc/d91/class_b_plus_tree.html#adc63cab61d4820aa058aedccab070079">   11</a></span>    <span class="keyword">using </span><a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#adc63cab61d4820aa058aedccab070079">value_type</a> = std::decay_t&lt;Value&gt;;</div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">   13</a></span>    <span class="keyword">using </span><a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">non_ptr_key_type</a> = std::remove_pointer_t&lt;key_type&gt;;</div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"><a class="line" href="../../dc/d91/class_b_plus_tree.html#aa70b82b52f594d220b9eaa03ef6f31da">   14</a></span>    <span class="keyword">using </span><a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#aa70b82b52f594d220b9eaa03ef6f31da">non_ptr_value_type</a> = std::remove_pointer_t&lt;value_type&gt;;</div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keyword">struct </span>Node {</div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        <span class="keywordtype">bool</span> is_leaf;</div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        std::vector&lt;non_ptr_key_type&gt; keys;</div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        std::vector&lt;std::unique_ptr&lt;Node&gt;&gt; children;</div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        std::vector&lt;non_ptr_value_type&gt; values;</div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        Node(<span class="keywordtype">bool</span> is_leaf) : is_leaf(is_leaf) {}</div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <span class="keywordtype">bool</span> is_full()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>            <span class="keywordflow">return</span> keys.size() == Order - 1;</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        }</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    };</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    std::unique_ptr&lt;Node&gt; root;</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../dc/d91/class_b_plus_tree.html#a4ccd5dac7e5eacf2d431947a3d49e4bd">   33</a></span>    <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#a4ccd5dac7e5eacf2d431947a3d49e4bd">BPlusTree</a>() : root(<a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::make_unique&lt;Node&gt;(true)) {}</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../dc/d91/class_b_plus_tree.html#a74274702b206c3a1f4a63fb4f9ac4f5e">   35</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#a74274702b206c3a1f4a63fb4f9ac4f5e">insert</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">non_ptr_key_type</a>&amp; key, <span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#aa70b82b52f594d220b9eaa03ef6f31da">non_ptr_value_type</a>&amp; value) {</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">if</span> (root-&gt;is_full()) {</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            <span class="keyword">auto</span> new_root = std::make_unique&lt;Node&gt;(<span class="keyword">false</span>);</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            new_root-&gt;children.push_back(std::move(root));</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            split_child(new_root.get(), 0);</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            root = std::move(new_root);</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        }</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        insert_non_full(root.get(), key, value);</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    }</div>
</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../dc/d91/class_b_plus_tree.html#af133b343b9abd92eac793b34a8357772">   45</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#af133b343b9abd92eac793b34a8357772">remove</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">non_ptr_key_type</a>&amp; key) {</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#af133b343b9abd92eac793b34a8357772">remove</a>(root.get(), key);</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">if</span> (root-&gt;keys.empty() &amp;&amp; !root-&gt;is_leaf) {</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            root = std::move(root-&gt;children[0]);</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../dc/d91/class_b_plus_tree.html#a7ee3751d4420eae4be8478d7fba13aa8">   52</a></span>    <span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#aa70b82b52f594d220b9eaa03ef6f31da">non_ptr_value_type</a>* <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#a7ee3751d4420eae4be8478d7fba13aa8">search</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">non_ptr_key_type</a>&amp; key)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#a7ee3751d4420eae4be8478d7fba13aa8">search</a>(root.get(), key);</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    }</div>
</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">void</span> split_child(Node* parent, <span class="keywordtype">int</span> index) {</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keyword">auto</span>&amp; node = parent-&gt;children[index];</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keyword">auto</span> new_node = std::make_unique&lt;Node&gt;(node-&gt;is_leaf);</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; Order / 2; ++i) {</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            new_node-&gt;keys.push_back(std::move(node-&gt;keys[i + Order / 2]));</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">if</span> (!node-&gt;is_leaf) {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                new_node-&gt;children.push_back(std::move(node-&gt;children[i + Order / 2]));</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                new_node-&gt;values.push_back(std::move(node-&gt;values[i + Order / 2]));</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            }</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        }</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">if</span> (!node-&gt;is_leaf) {</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            new_node-&gt;children.push_back(std::move(node-&gt;children[Order - 1]));</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            new_node-&gt;values.push_back(std::move(node-&gt;values[Order / 2]));</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        }</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        node-&gt;keys.resize(Order / 2);</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordflow">if</span> (node-&gt;is_leaf) {</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            node-&gt;values.resize(Order / 2);</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            node-&gt;children.resize(Order / 2 + 1);</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        }</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        parent-&gt;keys.insert(parent-&gt;keys.begin() + index, new_node-&gt;keys[0]);</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        parent-&gt;children.insert(parent-&gt;children.begin() + index + 1, std::move(new_node));</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordtype">void</span> insert_non_full(Node* node, <span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">non_ptr_key_type</a>&amp; key, <span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#aa70b82b52f594d220b9eaa03ef6f31da">non_ptr_value_type</a>&amp; value) {</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keywordflow">if</span> (node-&gt;is_leaf) {</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            <span class="keyword">auto</span> pos = std::lower_bound(node-&gt;keys.begin(), node-&gt;keys.end(), key);</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            <span class="keywordtype">int</span> index = pos - node-&gt;keys.begin();</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            node-&gt;keys.insert(pos, key);</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            node-&gt;values.insert(node-&gt;values.begin() + index, value);</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keyword">auto</span> pos = std::upper_bound(node-&gt;keys.begin(), node-&gt;keys.end(), key);</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <span class="keywordtype">int</span> index = pos - node-&gt;keys.begin();</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            <span class="keywordflow">if</span> (node-&gt;children[index]-&gt;is_full()) {</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                split_child(node, index);</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                <span class="keywordflow">if</span> (key &gt; node-&gt;keys[index]) {</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                    ++index;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                }</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            }</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            insert_non_full(node-&gt;children[index].get(), key, value);</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        }</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    }</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#af133b343b9abd92eac793b34a8357772">remove</a>(Node* node, <span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">non_ptr_key_type</a>&amp; key) {</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <span class="keywordflow">if</span> (node-&gt;is_leaf) {</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            <span class="keyword">auto</span> pos = std::lower_bound(node-&gt;keys.begin(), node-&gt;keys.end(), key);</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <span class="keywordflow">if</span> (pos != node-&gt;keys.end() &amp;&amp; *pos == key) {</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                node-&gt;keys.erase(pos);</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                node-&gt;values.erase(node-&gt;values.begin() + (pos - node-&gt;keys.begin()));</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            }</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            <span class="keyword">auto</span> pos = std::upper_bound(node-&gt;keys.begin(), node-&gt;keys.end(), key);</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            <span class="keywordtype">int</span> index = pos - node-&gt;keys.begin();</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            <span class="keywordflow">if</span> (pos != node-&gt;keys.begin() &amp;&amp; *(pos - 1) == key) {</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                <span class="comment">// Key is present in the internal node, replace it with its predecessor</span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                node-&gt;keys[index - 1] = get_max_key(node-&gt;children[index - 1].get());</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>                <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#af133b343b9abd92eac793b34a8357772">remove</a>(node-&gt;children[index - 1].get(), node-&gt;keys[index - 1]);</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#af133b343b9abd92eac793b34a8357772">remove</a>(node-&gt;children[index].get(), key);</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            }</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        }</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    }</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">non_ptr_key_type</a> get_max_key(Node* node)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">while</span> (!node-&gt;is_leaf) {</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            node = node-&gt;children.back().get();</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        }</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="keywordflow">return</span> node-&gt;keys.back();</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    }</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#aa70b82b52f594d220b9eaa03ef6f31da">non_ptr_value_type</a>* <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#a7ee3751d4420eae4be8478d7fba13aa8">search</a>(Node* node, <span class="keyword">const</span> <a class="code hl_typedef" href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">non_ptr_key_type</a>&amp; key)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <span class="keyword">auto</span> pos = std::lower_bound(node-&gt;keys.begin(), node-&gt;keys.end(), key);</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <span class="keywordflow">if</span> (pos != node-&gt;keys.end() &amp;&amp; *pos == key) {</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            <span class="keywordflow">if</span> (node-&gt;is_leaf) {</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                <span class="keywordflow">return</span> &amp;node-&gt;values[pos - node-&gt;keys.begin()];</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>            } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#a7ee3751d4420eae4be8478d7fba13aa8">search</a>(node-&gt;children[pos - node-&gt;keys.begin() + 1].get(), key);</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>            }</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            <span class="keywordflow">if</span> (node-&gt;is_leaf) {</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>                <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/d91/class_b_plus_tree.html#a7ee3751d4420eae4be8478d7fba13aa8">search</a>(node-&gt;children[pos - node-&gt;keys.begin()].get(), key);</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            }</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        }</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    }</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>};</div>
</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
<div class="foldopen" id="foldopen00151" data-start="{" data-end="}">
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"><a class="line" href="../../de/d8d/bplus_8hpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  151</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d8d/bplus_8hpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <a class="code hl_class" href="../../dc/d91/class_b_plus_tree.html">BPlusTree&lt;int, std::string&gt;</a> <a class="code hl_class" href="../../d4/d4d/classtree.html">tree</a>;</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <a class="code hl_class" href="../../d4/d4d/classtree.html">tree</a>.<a class="code hl_function" href="../../d4/d4d/classtree.html#a75e48363bb7d31de42b18a63bb06afed">insert</a>(1, <span class="stringliteral">&quot;one&quot;</span>);</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <a class="code hl_class" href="../../d4/d4d/classtree.html">tree</a>.<a class="code hl_function" href="../../d4/d4d/classtree.html#a75e48363bb7d31de42b18a63bb06afed">insert</a>(2, <span class="stringliteral">&quot;two&quot;</span>);</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <a class="code hl_class" href="../../d4/d4d/classtree.html">tree</a>.<a class="code hl_function" href="../../d4/d4d/classtree.html#a75e48363bb7d31de42b18a63bb06afed">insert</a>(3, <span class="stringliteral">&quot;three&quot;</span>);</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <a class="code hl_class" href="../../d4/d4d/classtree.html">tree</a>.<a class="code hl_function" href="../../d4/d4d/classtree.html#a75e48363bb7d31de42b18a63bb06afed">insert</a>(4, <span class="stringliteral">&quot;four&quot;</span>);</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <a class="code hl_class" href="../../d4/d4d/classtree.html">tree</a>.<a class="code hl_function" href="../../d4/d4d/classtree.html#a75e48363bb7d31de42b18a63bb06afed">insert</a>(5, <span class="stringliteral">&quot;five&quot;</span>);</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keyword">const</span> <span class="keyword">auto</span>* value = <a class="code hl_class" href="../../d4/d4d/classtree.html">tree</a>.search(3);</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="keywordflow">if</span> (value) {</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        std::cout &lt;&lt; *value &lt;&lt; std::endl; <span class="comment">// Output: three</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    }</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <a class="code hl_class" href="../../d4/d4d/classtree.html">tree</a>.<a class="code hl_function" href="../../d4/d4d/classtree.html#a73beb0e756fc71efca1224f31e0925b7">remove</a>(3);</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    value = <a class="code hl_class" href="../../d4/d4d/classtree.html">tree</a>.search(3);</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="keywordflow">if</span> (!value) {</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Value not found&quot;</span> &lt;&lt; std::endl; <span class="comment">// Output: Value not found</span></div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    }</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>}</div>
</div>
<div class="ttc" id="abplus_8hpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d8d/bplus_8hpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>定义</b> <a href="#l00151">bplus.hpp:151</a></div></div>
<div class="ttc" id="aclass_b_plus_tree_html"><div class="ttname"><a href="../../dc/d91/class_b_plus_tree.html">BPlusTree</a></div><div class="ttdef"><b>定义</b> <a href="#l00008">bplus.hpp:8</a></div></div>
<div class="ttc" id="aclass_b_plus_tree_html_a4ccd5dac7e5eacf2d431947a3d49e4bd"><div class="ttname"><a href="../../dc/d91/class_b_plus_tree.html#a4ccd5dac7e5eacf2d431947a3d49e4bd">BPlusTree::BPlusTree</a></div><div class="ttdeci">BPlusTree()</div><div class="ttdef"><b>定义</b> <a href="#l00033">bplus.hpp:33</a></div></div>
<div class="ttc" id="aclass_b_plus_tree_html_a74274702b206c3a1f4a63fb4f9ac4f5e"><div class="ttname"><a href="../../dc/d91/class_b_plus_tree.html#a74274702b206c3a1f4a63fb4f9ac4f5e">BPlusTree::insert</a></div><div class="ttdeci">void insert(const non_ptr_key_type &amp;key, const non_ptr_value_type &amp;value)</div><div class="ttdef"><b>定义</b> <a href="#l00035">bplus.hpp:35</a></div></div>
<div class="ttc" id="aclass_b_plus_tree_html_a7ee3751d4420eae4be8478d7fba13aa8"><div class="ttname"><a href="../../dc/d91/class_b_plus_tree.html#a7ee3751d4420eae4be8478d7fba13aa8">BPlusTree::search</a></div><div class="ttdeci">const non_ptr_value_type * search(const non_ptr_key_type &amp;key) const</div><div class="ttdef"><b>定义</b> <a href="#l00052">bplus.hpp:52</a></div></div>
<div class="ttc" id="aclass_b_plus_tree_html_a950402099e27c7d4496286691f154f68"><div class="ttname"><a href="../../dc/d91/class_b_plus_tree.html#a950402099e27c7d4496286691f154f68">BPlusTree::key_type</a></div><div class="ttdeci">std::decay_t&lt; Key &gt; key_type</div><div class="ttdef"><b>定义</b> <a href="#l00010">bplus.hpp:10</a></div></div>
<div class="ttc" id="aclass_b_plus_tree_html_aa70b82b52f594d220b9eaa03ef6f31da"><div class="ttname"><a href="../../dc/d91/class_b_plus_tree.html#aa70b82b52f594d220b9eaa03ef6f31da">BPlusTree::non_ptr_value_type</a></div><div class="ttdeci">std::remove_pointer_t&lt; value_type &gt; non_ptr_value_type</div><div class="ttdef"><b>定义</b> <a href="#l00014">bplus.hpp:14</a></div></div>
<div class="ttc" id="aclass_b_plus_tree_html_adc63cab61d4820aa058aedccab070079"><div class="ttname"><a href="../../dc/d91/class_b_plus_tree.html#adc63cab61d4820aa058aedccab070079">BPlusTree::value_type</a></div><div class="ttdeci">std::decay_t&lt; Value &gt; value_type</div><div class="ttdef"><b>定义</b> <a href="#l00011">bplus.hpp:11</a></div></div>
<div class="ttc" id="aclass_b_plus_tree_html_af133b343b9abd92eac793b34a8357772"><div class="ttname"><a href="../../dc/d91/class_b_plus_tree.html#af133b343b9abd92eac793b34a8357772">BPlusTree::remove</a></div><div class="ttdeci">void remove(const non_ptr_key_type &amp;key)</div><div class="ttdef"><b>定义</b> <a href="#l00045">bplus.hpp:45</a></div></div>
<div class="ttc" id="aclass_b_plus_tree_html_af24560b7c01bdcaa955e9e50f5cd476a"><div class="ttname"><a href="../../dc/d91/class_b_plus_tree.html#af24560b7c01bdcaa955e9e50f5cd476a">BPlusTree::non_ptr_key_type</a></div><div class="ttdeci">std::remove_pointer_t&lt; key_type &gt; non_ptr_key_type</div><div class="ttdef"><b>定义</b> <a href="#l00013">bplus.hpp:13</a></div></div>
<div class="ttc" id="aclasstree_html"><div class="ttname"><a href="../../d4/d4d/classtree.html">tree</a></div><div class="ttdoc">在TRP-CRM中大量的数据处理需要使用树形结构表，如BOM表，部门结构表，项目任务计划表等。</div><div class="ttdef"><b>定义</b> <a href="../../de/dfd/tree_8hpp_source.html#l00027">tree.hpp:28</a></div></div>
<div class="ttc" id="aclasstree_html_a73beb0e756fc71efca1224f31e0925b7"><div class="ttname"><a href="../../d4/d4d/classtree.html#a73beb0e756fc71efca1224f31e0925b7">tree::remove</a></div><div class="ttdeci">emErrCode remove(treeNode *node)</div><div class="ttdoc">删除节点</div><div class="ttdef"><b>定义</b> <a href="../../de/dfd/tree_8hpp_source.html#l00705">tree.hpp:705</a></div></div>
<div class="ttc" id="aclasstree_html_a75e48363bb7d31de42b18a63bb06afed"><div class="ttname"><a href="../../d4/d4d/classtree.html#a75e48363bb7d31de42b18a63bb06afed">tree::insert</a></div><div class="ttdeci">emErrCode insert(treeNode *parent, const reference value)</div><div class="ttdoc">在给定的父节点下添加一个孩子节点。这个函数只会在父节点下的所有孩子节点最后添加</div><div class="ttdef"><b>定义</b> <a href="../../de/dfd/tree_8hpp_source.html#l00607">tree.hpp:607</a></div></div>
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdef"><b>定义</b> <a href="../../d1/d92/mandarava_2event_8hpp_source.html#l00038">event.hpp:39</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
制作者&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.11.0
</small></address>
</div><!-- doc-content -->
</body>
</html>
